- arithmetically equivalent
- мат.арифметически эквивалентный
English-Russian scientific dictionary. 2008.
arithmetically equivalent
Смотреть что такое "arithmetically equivalent" в других словарях:
Dedekind zeta function — In mathematics, the Dedekind zeta function of an algebraic number field K, generally denoted ζK(s), is a generalization of the Riemann zeta function which is obtained by specializing to the case where K is the rational numbers Q. In particular,… … Wikipedia
arithmetic — arithmetically, adv. n. /euh rith meuh tik/; adj. /ar ith met ik/, n. 1. the method or process of computation with figures: the most elementary branch of mathematics. 2. Also called higher arithmetic, theoretical arithmetic. the theory of… … Universalium
mathematics — /math euh mat iks/, n. 1. (used with a sing. v.) the systematic treatment of magnitude, relationships between figures and forms, and relations between quantities expressed symbolically. 2. (used with a sing. or pl. v.) mathematical procedures,… … Universalium
Arithmetical hierarchy — In mathematical logic, the arithmetical hierarchy, arithmetic hierarchy or Kleene hierarchy classifies certain sets based on the complexity of formulas that define them. Any set that receives a classification is called arithmetical. The… … Wikipedia
Boolean algebra — This article discusses the subject referred to as Boolean algebra. For the mathematical objects, see Boolean algebra (structure). Boolean algebra, as developed in 1854 by George Boole in his book An Investigation of the Laws of Thought,[1] is a… … Wikipedia
Reference range — Reference ranges edit in: blood urine CSF feces In health related fields, a reference range or reference interval usually describes the variations of a measurement or value in healthy i … Wikipedia
Ω-consistent theory — In mathematical logic, an ω consistent (or omega consistent, also called numerically segregativeW.V.O. Quine, Set Theory and its Logic ] ) theory is a theory (collection of sentences) that is not only (syntactically) consistent (that is, does not … Wikipedia
ω-consistent theory — In mathematical logic, an ω consistent (or omega consistent, also called numerically segregative[1]) theory is a theory (collection of sentences) that is not only (syntactically) consistent (that is, does not prove a contradiction), but also… … Wikipedia
Pointer (computing) — This article is about the programming data type. For the input interface (for example a computer mouse), see Pointing device. Pointer a pointing to the memory address associated with variable b. Note that in this particular diagram, the computing … Wikipedia
Algorithmically random sequence — Intuitively, an algorithmically random sequence (or random sequence) is an infinite sequence of binary digits that appears random to any algorithm. The definition applies equally well to sequences on any finite set of characters. Random sequences … Wikipedia
George Peacock — Infobox Scientist name = George Peacock box width = 300px image width = 170px caption = birth date = April 9, 1791 birth place = Denton, Yorkshire, England death date = November 8, 1858 death place = Pall Mall, London, England residence = England … Wikipedia
